The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(1)).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a(x1) → b(c(b(x1)))
a(b(x1)) → x1
c(c(b(x1))) → a(c(c(x1)))

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → b(c(b(z0)))
a(b(z0)) → z0
c(c(b(z0))) → a(c(c(z0)))

Tuples:

A(z0) → c1(C(b(z0)))
C(c(b(z0))) → c3(A(c(c(z0))), C(c(z0)), C(z0))

S tuples:

A(z0) → c1(C(b(z0)))
C(c(b(z0))) → c3(A(c(c(z0))), C(c(z0)), C(z0))

K tuples:none
Defined Rule Symbols:

a, c

Defined Pair Symbols:

A, C

Compound Symbols:

c1, c3

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

C(c(b(z0))) → c3(A(c(c(z0))), C(c(z0)), C(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → b(c(b(z0)))
a(b(z0)) → z0
c(c(b(z0))) → a(c(c(z0)))

Tuples:

A(z0) → c1(C(b(z0)))

S tuples:

A(z0) → c1(C(b(z0)))

K tuples:none
Defined Rule Symbols:

a, c

Defined Pair Symbols:

A

Compound Symbols:

c1

(5) CdtGraphRemoveDanglingProof (ComplexityIfPolyImplication transformation)

Removed 1 of 1 dangling nodes:

A(z0) → c1(C(b(z0)))

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → b(c(b(z0)))
a(b(z0)) → z0
c(c(b(z0))) → a(c(c(z0)))

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

a, c

Defined Pair Symbols:none

Compound Symbols:none

(7) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(8) BOUNDS(O(1), O(1))